On extensions of ALGOL-like languages

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Objects and Classes in Algol-Like Languages

Many object-oriented languages used in practice descend from Algol. With this motivation, we study the theoretical issues underlying such languages via the theory of Algollike languages. It is shown that the basic framework of this theory extends cleanly and elegantly to the concepts of objects and classes. An important idea that comes to light is that classes are abstract data types, whose the...

متن کامل

Semantics of Dynamic Variables in Algol-like Languages

A denotational semantic model of an Algol-like programming language with local variables, providing fully functional dynamic variable manipulation is presented. Along with the other usual language features, the standard operations with pointers, that is reattachement and dereferencing, and dynamic variables, that is creation and assignment, are explicated using a possible worlds, functor catego...

متن کامل

On the Semantics of the Bad-Variable Constructor in Algol-like Languages

The fully abstract games model of Reynolds’s Idealized Algol is adapted to provide a characterization of the language without the “bad variable constructor” mkvar. The model shows that the addition of mkvar to the language is conservative for observational equivalence but not for the observational preorder.

متن کامل

Algol-like Language

We present a denotational semantics for an Algol-like language Alg, which is fully abstract for the second order subset of Alg. This constitutes the rst signiicant full abstraction result for a block structured language with local variables. As all the published`test equivalences' 13, 8, 23] for Algol-like languages are contained in the second order subset, they can all be validated (easily) in...

متن کامل

Reasoning about Idealized ALGOL Using Regular Languages

We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our method of reasoning inherits its desirable theoretical properties. The method is mathematically elementary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1974

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(74)90732-3